翻訳と辞書 Words near each other ・ Hamilton-Mehta Productions ・ Hamilton-Tolliver Complex ・ Hamilton-Wenham Regional High School ・ Hamilton-Wentworth Catholic District School Board ・ Hamilton-Wentworth District School Board ・ Hamilton/Wenham (MBTA station) ・ Hamiltonban Township, Adams County, Pennsylvania ・ Hamiltonella ・ Hamiltonella defensa ・ Hamiltonhill ・ Hamiltonhill Branch ・ Hamiltonian ・ Hamiltonian (control theory) ・ Hamiltonian (quantum mechanics) ・ Hamiltonian coloring ・ Hamiltonian completion ・ Hamiltonian constraint ・ Hamiltonian constraint of LQG ・ Hamiltonian economic program ・ Hamiltonian field theory ・ Hamiltonian fluid mechanics ・ Hamiltonian lattice gauge theory ・ Hamiltonian matrix ・ Hamiltonian mechanics ・ Hamiltonian optics ・ Hamiltonian path ・ Hamiltonian path problem ・ Hamiltonian spite ・ Hamiltonian system ・ Hamiltonian vector field Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Hamiltonian completion ： ウィキペディア英語版 Hamiltonian completion The Hamiltonian completion problem is to find the minimal number of edges to add to a graph to make it Hamiltonian. The problem is clearly NP-hard in general case (since its solution gives an answer to the NP-complete problem of determining whether a given graph has a Hamiltonian cycle). The associated decision problem of determining whether ''K'' edges can be added to a given graph to produce a Hamiltonian graph is NP-complete. Moreover, Hamiltonian completion belongs to the APX complexity class, i.e., it is unlikely that efficient constant ratio approximation algorithms exist for this problem.〔Q. S. Wu, C. L. Lu, R. C. T. Lee, ( An Approximate Algorithm for the Weighted Hamiltonian Path Completion Problem on a Tree ), ''Lecture Notes in Computer Science'', Vol. 1969 (2000) Pages: 156 - 167 〕 The problem may be solved in polynomial time for certain classes of graphs, including series-parallel graphs〔.〕 and their generalizations,〔N. M. Korneyenko, Combinatorial algorithms on a class of graphs, ''Discrete Applied Mathematics, v.54 n.2-3, p.215-217, 1994〕 which include outerplanar graphs, as well as for a line graph of a tree〔Arundhati Raychaudhuri, (The total interval number of a tree and the Hamiltonian completion number of its line graph ), 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Hamiltonian completion」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.